class Solution2 {
    public int minInsertions(String s) {
         int len = s.length() ;
         char[] arr = s.toCharArray() ;
         int[][] dp = new int[len][len] ; 
         for(int i= len-1 ; i >= 0 ; i--){
            for(int j=i ; j < len ; j ++){
                if(arr[i] == arr[j]){
                  dp[i][j] = i+1 < j ? dp[i+1][j-1] : 0 ;
                }else{
                  dp[i][j] = Math.min(dp[i+1][j] , dp[i][j-1]) +1 ;
                }
            }
         }
         return dp[0][len-1] ; 
    }
}
class Solution {
    public int longestCommonSubsequence(String text1, String text2) {
        int len1 = text1.length();
        int len2 = text2.length() ;
        int[][] dp = new int[len1+1][len2+1];
        text1 = " "+text1;
        text2 = " "+text2 ;
        char[] arr1 = text1.toCharArray() ;
        char[] arr2 = text2.toCharArray() ;
        for(int i=1 ; i <= len1 ; i ++){
            for(int j=1 ; j <= len2 ; j ++){
                if(arr1[i] == arr2[j]){
                    dp[i][j] = 1+dp[i-1][j-1] ;
                }else{
                    dp[i][j] = Math.max(dp[i][j-1],dp[i-1][j]);
                }
            }
        }
        return dp[len1][len2] ;
    }
}